Interacting Self-Timed Pipelines and Elementary Coupling Control Modules
نویسندگان
چکیده
منابع مشابه
Interacting Self-Timed Pipelines and Elementary Coupling Control Modules
SUMMARY The self-timed pipeline (STP) is one of the most promising VLSI/SoC architectures. It achieves efficient utilization of tens of billions of transistors, consumes ultra low power, and is easy-to-design because of its signal integrity and low electromagnetic interference. These basic features of the STP have been proven by the development of self-timed data-driven multimedia processors, D...
متن کاملBubbles Can Make Self-Timed Pipelines Fastt
We explore the practical limits on throughput imposed by timing in a long, self-timed, circulating pipeline (ring). We consider models with both fixed and random delays and derive exact results for pipelines where these delays are fixed or exponentially distributed random variables. We also give relationships that provide upper and lower bounds on throughput for any pipeline where the delays ar...
متن کاملTimed Automata for Modelling Caches and Pipelines
We focus on modelling the timing aspects of binary programs running on architectures featuring caches and pipelines. The objective is to obtain a model to compute tight bounds for the worst-case execution time (WCET) of binary programs. The reader is referred to [11] for an exhaustive presentation of WCET computation techniques and tools. The main approach for computing the WCET is based on abs...
متن کاملLatency and Throughput Tradeoffs in Self-Timed Speed-Independent Pipelines and Rings
Asynchronous pipelines control the flow of tokens through a sequence of logical stages based on the status of local completion detectors. As in a synchronously clocked circuit, the design of self-timed pipelines can trade off between achieving low latency and high throughput. However, there are more degrees of freedom because of the variances in specific latch and function block styles, and the...
متن کاملdedekind modules and dimension of modules
در این پایان نامه، در ابتدا برای مدول ها روی دامنه های پروفر شرایط معادل به دست آورده ایم و خواصی از ددکیند مدول ها روی دامنه های پروفر مشخص کرده ایم. در ادامه برای ددکیند مدول های با تولید متناهی روی حلقه های به طور صحیح بسته شرایط معادل به دست آورده ایم و ددکیند مدول های ضربی را مشخص کرده ایم. گزاره هایی در مورد بعد ددکیند مدول ها بیان کرده ایم. در پایان، قضایای lying over و going down را برا...
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2009
ISSN: 0916-8508,1745-1337
DOI: 10.1587/transfun.e92.a.1642